Parallel algorithms for VLSI circuit extraction

نویسندگان

  • Krishna P. Belkhale
  • Prithviraj Banerjee
چکیده

Parallel processing has recently become an extremely attractive and cost effective way of achieving orders of magnitude performance improvements in VLSI CAD applications. In this paper, we propose parallel algorithms to speed up the VLSI circuit extraction task. Given a VLSI layout as input, the problem of circuit extraction consists of determining the circuit connectivity and estimating the various electrical parameters such as the resistances of lines, capacitances of nodes, and dimensions of devices. Circuit extraction is a computationally intensive problem. The basic approach used in the parallel algorithms is the partitioning of a circuit into smaller regions, assigning each region to a processor and having the processors cooperate in performing the extraction procedures. We present a number of partitioning strategies that could be used. We have implemented the parallel algorithms on an Intel iPSC2 hypercube and an Encore 510 multimax shared memory multiprocessor. ADDRESS FOR CORRESPONDENCE P. Banerjee Computer Systems Group Coordinated Science Laboratory University of Illinois 1101 W. Springfield Av. Urbana, IL-61801 (217) 244-6564

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Algorithm for Hierarchical Circuit Extraction

In ICCAD88, 89, we proposed efficient parallel algorithms to speed up the task of VLSI circuit extraction on distributed memory multiprocessors. The input to the algorithms is a flat description of the circuit, in terms of the rectangles in different layers. In this paper, we describe an algorithm that combines the benefits of hierarchical analysis and parallelism. The input is a hierarchical d...

متن کامل

Propercad: a Portable Object-oriented Parallel Environment for Vlsi Cad

Most parallel algorithms for VLSI CAD proposed to date have one important drawback: they work eeciently only on machines that they were designed for. As a result, algorithms designed to date are dependent on the architecture for which they are developed and do not port easily to other parallel architectures. This paper describes a new project under way to address this problem. We have developin...

متن کامل

PACE2: an improved parallel VLSI extractor with parameter extraction

In ICCAD88, we had proposed an efficient parallel algorithm PACE to speed up the first phase of VLSI circuit extraction, called the net list extraction phase. In this paper, we describe an algorithm PACE2 targeted to the second phase of extraction, called the parameter extraction phase. We have interfaced two models for resistance and capacitance. In this paper, we also propose a different part...

متن کامل

Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning

In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...

متن کامل

Design of a Pixel-parallel Feature Extraction Vlsi System for Biologically-inspired Object Recognition Methods

This paper proposes a biologically-inspired feature extraction method, which consists of coarse region segmentation by a resistive-fuse network and feature extraction by Gabor wavelet transforms. Their pixel-parallel VLSI implementation based on the pulse modulation circuit architecture is described, and measurement results of Gabor filter operation by a test LSI chip with 1-D 20-pixels are pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. on CAD of Integrated Circuits and Systems

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1991